Push-to-Pull Peer-to-Peer Live Streaming Thomas Locher, Remo Meier, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland {lochert,remmeier,schmiste

Source URL: www.tik.ee.ethz.ch

• File sharing
• Distributed data storage
• Network architecture
• Peer-to-peer
• Distributed hash table
• Hash list
• Clientserver model
• Tiny Encryption Algorithm

SpADe: On Shape-based Pattern Detection in Streaming Time Series Yueguo Chen§ Mario A. Nascimento†∗ §

Source URL: www.comp.nus.edu.sg

• Dynamic programming
• Elementary mathematics
• Dynamic time warping
• Time series analysis
• Combinatorics
• Search algorithms
• Sequence
• Subsequence
• Longest common subsequence problem
• K-nearest neighbors algorithm
• Pattern matching
• Euclidean distance

Practically engageable adversaries for streaming media Brian Sniffen Akamai Technologies

Source URL: evenmere.org

• Computer access control
• Internet protocols
• Multimedia
• Network protocols
• Internet broadcasting
• Streaming media
• Security token
• Hypertext Transfer Protocol
• Proxy server
• Adaptive bitrate streaming
• Time-based One-time Password Algorithm

Push-to-Pull Peer-to-Peer Live Streaming Thomas Locher, Remo Meier, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland {lochert,remmeier,schmiste

Source URL: dcg.ethz.ch

• File sharing
• Distributed data storage
• Network architecture
• Peer-to-peer
• Distributed hash table
• Hash list
• Clientserver model
• Tiny Encryption Algorithm

A A space efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox arXiv:1212.2264v3 [cs.DS] 4 Dec 2013

Source URL: arxiv.org

Amit Chakrabarti Curriculum Vitae April 2014 Associate Professor Department of Computer Science

Source URL: www.cs.dartmouth.edu

• Theoretical computer science
• Academia
• Computer science
• Computational complexity theory
• Algorithms
• Streaming algorithm
• Symposium on Discrete Algorithms
• Communication complexity
• Bernard Chazelle
• Machtey Award

A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams 117 A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams

Source URL: utopia.duth.gr

• Computer science
• Linked list
• Hash table
• Stack
• Streaming algorithm
• Heap
• Network congestion
• Cuckoo hashing
• Time complexity
• Search algorithms
• Theoretical computer science
• Applied mathematics

Microsoft PowerPoint - mnet_03_Transport_Layer_2010_11_26

Source URL: www.net.in.tum.de

• Internet protocols
• TCP/IP
• Internet standards
• Streaming
• OSI protocols
• Transport layer
• Transmission Control Protocol
• User Datagram Protocol
• TCP congestion avoidance algorithm
• Computing
• Network architecture
• Data

A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two

Source URL: www.cs.utah.edu

• Mathematics
• Algorithms
• Streaming algorithm
• Time complexity
• Quantile
• Applied mathematics
• Computational complexity theory
• Computer science

Mergeable Summaries Pankaj K. Agarwal Graham Cormode Zhewei Wei

Source URL: www.cs.utah.edu

• Asymptotic analysis
• Algorithms
• Streaming algorithm
• VC dimension
• Order statistic
• Quantile
• Open set
• Big O notation
• Ε-net
• Statistics
• Mathematics
• Summary statistics